An elliptic theory of indicial weights and applications to non-linear geometry problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-coercive Linear Elliptic Problems

We study here some linear elliptic partial differential equations (with Dirichlet, Fourier or mixed boundary conditions), to which convection terms (first order perturbations) are added that entail the loss of the classical coercivity property. We prove the existence, uniqueness and regularity results for the solutions to these problems. Mathematics Subject Classification (2000): 35J25.

متن کامل

Efficient metacomputing of elliptic linear and non-linear problems

Metacomputing is a method of using the GRID, which originated in the US and quickly was also picked up by European and Japanese researchers where a number of challenging projects were aiming at the exploitation of such distributed resources. Especially the GLOBUS project (The globus project: a status report, Proceedings IPPS/SPDP’98 Heterogeneous Computing Workshop, 1998, pp. 4–18) has contribu...

متن کامل

Network Problems with Non-Polynomial Weights and Applications

The most efficient algorithms for several network problems like minimum cost flow and the maximum weight matching problem follow the primal-dual paradigm. These algorithms perform arithmetic (additions and subtractions) on numbers of magnitude O(nC) when the edge weights (also called costs) are integers bounded by C and n denotes the number of vertices. Under the standard assumption that arithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 2018

ISSN: 0022-1236

DOI: 10.1016/j.jfa.2017.08.003